Statistical mechanics of combinatorial optimization problems with site disorder
نویسندگان
چکیده
منابع مشابه
Statistical mechanics of combinatorial optimization problems with site disorder.
We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite-temperature traveling salesman problem on several different domains and various problems in one dimension such as the so-called descent problem. We first motivate our method by analyzing these problems using...
متن کاملAn Asymptotical Study of Combinatorial Optimization Problems by Means of Statistical Mechanics
The analogy between combinatorial optimization and statistical mechanics has proven to be a fruitful object of study. Simulated annealing, a metaheuristic for combinatorial optimization problems, is based on this analogy. In this paper we use the statistical mechanics formalism based on the above mentioned analogy to analyze the asymptotic behavior of a special class of combinatorial optimizati...
متن کاملApplications of Statistical Mechanics to Combinatorial Search Problems
The statistical mechanics of combinatorial search problems is described using the example of the well-known NP-complete graph coloring problem. We focus on a recently identified phase transition from underto overconstrained problems, near which are concentrated many hard to solve search problems. Thus, a readily computed measure of problem structure predicts the difficulty of solving the proble...
متن کاملStatistical mechanics of combinatorial auctions.
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are found and interpreted in terms of the geometric structure of the space of solutions. We introduce an iterative algorithm to solve intermediate and large instan...
متن کاملStatistical Design of Genetic Algorithms for Combinatorial Optimization Problems
Many genetic algorithms GA have been applied to solve different NP-complete combinatorial optimization problems so far. The striking point of using GA refers to selecting a combination of appropriate patterns in crossover, mutation, and and so forth and fine tuning of some parameters such as crossover probability, mutation probability, and and so forth. One way to design a robust GA is to selec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.026125